Efficient Generation of Triangle Strips from Triangulated Meshes
نویسندگان
چکیده
This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the models. A data structure that allows efficient triangle strip generation is also described. The method is based on simple heuristics, significantly reducing the number of vertices used to describe the triangulated models. We demonstrate the effectiveness and speed of our method comparing it against the best available program.
منابع مشابه
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this pap...
متن کاملMemory Efficient Adjacent Triangle Connectivity of a Face Using Triangle Strips
We often need to refer to adjacent elements (e.g., vertices, edges and faces) in triangle meshes for rendering, mesh simplification and other processes. It is, however, sometimes impossible to prepare the enormous memory needed to represent element connectivity in gigantic triangle meshes. We proposed a memory efficient scheme for referring to adjacent faces around a vertex in non-manifold tria...
متن کاملciently Generating Triangle Strips for Fast
Almost all scienti c visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can signi cantly reduce rendering times over tran...
متن کاملEeciently Generating Triangle Strips for Fast Rendering
Almost all scientiic visualization involving surfaces is currently done via triangles. The speed at which such triangulated surfaces can be displayed is crucial to interactive visualization and is bounded by the rate at which triangulated data can be sent to the graphics subsystem for rendering. Partitioning polygonal models into triangle strips can signiicantly reduce rendering times over tran...
متن کاملEfficiently using connectivity information between triangles in a mesh for real-time renderin
Triangle meshes are the most popular standard model used to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphics system. Taking advantage of the connectivity information between the triangles in a mesh dramatically diminishes the amount of information the graphics system must handle. Multiresolution Tr...
متن کامل